On Boolean Feature Types
نویسندگان
چکیده
We study the compatibility of a construction proposed by Aït-Kaci to extend a poset of sorts into a lattice with the specification on type constraints on the value of attributes, through Gloess assorted signatures. We first show that it is natural to extend the poset into a boolean algebra, when one wishes to obtain a complete and complementary lattice endowed with a smooth semantics. We then show that any assortment may be extended from a poset to a complete lattice extension. A minimal and a maximal extended assortments may be built from the given assortment.
منابع مشابه
TDL--- A Type Description Language for Constraint-Based Grammars
This paper presents TDL, a typed feature-based representation language and inference system. Type deeni-tions in TDL consist of type and feature constraints over the boolean connectives. TDL supports open-and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. EEcient reasoning in TDL is acc...
متن کاملUsing boolean and fuzzy logic combined with analytic hierarchy process for hazardous waste landfill site selection: A case study from Hormozgan province, Iran
Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where th...
متن کاملFlow Feature Visualization Using Logical Operators on Multivariate Fields
Due to the large size of high-dimensional datasets that result from contemporary computational flow simulations, the classification and visualization of features is an essential, though challenging task for proper scientific analysis. We present a visualization system based on first-order fuzzy logic, that allows to convert natural language statements involving multiple scalar properties into w...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملPerformance Evaluation of Co-location Miner
Given a collection of boolean spatial features, the co-location pattern discovery process nds the subsets of features frequently located together. For example, the analysis of an ecology dataset may reveal the frequent co-location of a re ignition source feature with a needle vegetation type feature and a drought feature. The spatial co-location rule problem is diierent from the association rul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992